The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem
نویسندگان
چکیده
منابع مشابه
The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem
We determine the exact threshold of satisfiability for random instancesof a particular NP-complete constraint satisfaction problem (CSP). This isthe first random CSP model for which we have determined a precise linearsatisfiability threshold, and for which random instances with density nearthat threshold appear to be computationally difficult. More formally,it is the first r...
متن کاملA sharp threshold for a random constraint satisfaction problem
We consider random instances I of a constraint satisfaction problem generalizing k-SAT: given n boolean variables, m ordered k-tuples of literals, and q “bad” clause assignments, find an assignment which does not set any of the k-tuples to a bad clause assignment. We consider the case where k = Ω(log n), and generate instance I by including every k-tuple of literals independently with probabili...
متن کاملThe Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems
We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models are robust in the sense that they exhibit a non-trivial threshold of satisfiability, and we determine the asymptotic order of that threshold. We also provide resolution complexity lower bounds for these models. One of our resul...
متن کاملSatisfiability Transition and Experiments on a Random Constraint Satisfaction Problem Model
Random constraint satisfaction problem models play a significant role in computer science. They provide instances for benchmarking algorithms, help inform the design of algorithms and heuristics, and provide insight into problem hardness. In this paper, model RA which was revised from classical model A, was studied. When parameter k satisfied 3 k , model RA has the same satisfiability transit...
متن کاملA Random Constraint Satisfaction Problem That Seems Hard for DPLL
This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so is easier to analyze. For example, the exact satisfiability threshold for this problem is known, and the problem has high resolution complexity. In this paper, we prove the problem appears hard for DPLL. Specifically, if we pick...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2012
ISSN: 0895-4801,1095-7146
DOI: 10.1137/090777268